6 th Workshop on Fixed Points in Computer Science FICS 2009
نویسنده
چکیده
In this report, we prove the undecidability of Core XPath 1.0 (CXP) [6] extended with an Inflationary Fixed Point (IFP) operator. We prove that the satisfiability problem of this language is undecidable. In fact, the fragment of CXP+IFP containing only the self and descendant axes is already undecidable.
منابع مشابه
Eptcs 191 Fixed Points in Computer Science Table of Contents Topological Dynamics and Decidability of Infinite Constraint Satisfaction Reachability Problems for Continuous Linear Dynamical Systems Dependent Inductive and Coinductive Types Are Fibrational Dialgebras
Fixed points play a fundamental role in several areas of computer science. They are used to justify (co)recursive definitions and associated reasoning techniques. The construction and properties of fixed points have been investigated in many different settings such as: design and implementation of programming languages, logics, verification, databases. The aim of this workshop is to provide a f...
متن کاملOn Core XPath with Inflationary Fixed Points
In this report, we prove the undecidability of Core XPath 1.0 (CXP) [6] extended with an Inflationary Fixed Point (IFP) operator. We prove that the satisfiability problem of this language is undecidable. In fact, the fragment of CXP+IFP containing only the self and descendant axes is already undecidable.
متن کاملEPTCS 77 Proceedings of the 8 th Workshop on Fixed Points in Computer Science
Fixed points play a fundamental role in several areas of computer science and logic by justifying induction and recursive definitions. The construction and properties of fixed points have been investigated in many different frameworks such as: design and implementation of programming languages, program logics, and databases. The aim of this workshop is to provide a forum for researchers to pres...
متن کاملOn some fixed points properties and convergence theorems for a Banach operator in hyperbolic spaces
In this paper, we prove some fixed points properties and demiclosedness principle for a Banach operator in uniformly convex hyperbolic spaces. We further propose an iterative scheme for approximating a fixed point of a Banach operator and establish some strong and $Delta$-convergence theorems for such operator in the frame work of uniformly convex hyperbolic spaces. The results obtained in this...
متن کاملFixed Points on Partial Randomness
Algorithmic information theory (AIT, for short) is a theory of program-size and algorithmic randomness. One of the primary concepts of AIT is the Kolmogorov complexity K(s) of a finite binary string s, which is defined as the length of the shortest binary program for a universal decoding algorithm to output s. In this paper, we report on a quite new type of fixed point in computer science, call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009